The outflow ranking method for weighted directed graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The outflow ranking method for weighted directed graphs

A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this paper we axiomatize the ranking method that ranks the nodes according to their outflow using four independent axioms. This outflow ranking method generalizes the ranking by outdegree for directed graphs. Furthermore, we compare our axioms with other axioms discussed in the literature.

متن کامل

On weighted directed graphs

Article history: Received 6 January 2011 Accepted 16 June 2011 Available online 18 July 2011 Submitted by S. Kirkland AMS classification: 05C50 05C05 15A18

متن کامل

Ranking by outdegree for directed graphs

A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we axiomatize the ranking method that ranks the nodes according to their outdegree. This method generalizes the ranking by Copeland score for tournaments as characterized in Rubinstein (SIAM J. Appl. Math. 38 (1980) 108–111). c © 2003 Elsevier B.V. All rights reserved.

متن کامل

Similarity of Weighted Directed Acyclic Graphs

This thesis proposes a weighted DAG (wDAG) similarity algorithm for match-making in e-Business environments. We focus on the metadata representation of buyer and seller agents, as well as a similarity and associated simplicity measure over this information. In order to make the interaction between agents more meaningful and fine-grained, we choose node-labeled, arc-labeled and arc-weighted dire...

متن کامل

An Algebraic Framework of Weighted Directed Graphs

We show that an algebraic formulation of weighted directed graphs leads to introducing a k-vector space equipped with two coproducts ∆ and˜∆ verifying the so-called coassociativity breaking equation (˜ ∆ ⊗ id)∆ = (id ⊗∆) ˜ ∆. Such a space is called an L-coalgebra. Explicit examples of such spaces are constructed and links between graph theory and coassociative coalgebras are given. 1. Introduct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2009

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2007.11.051